Sublinear bounds for randomized leader election

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...

Randomized Self-Stabilizing Leader Election (Extended Abstract)

Randomized Leader Election Protocols Ad-hoc Networks

Unlike the well-studied cellular networks that assume the existence of robust infrastructure, Ad-hoc Networks (AHN, for short) are rapidly deplo able, self-organizing, and do not rely on an existing infrastructure. These networks find applications to disaster-relief, search-and-rescue, law-enforcement, and collaborative computing, among others. The main contribution of this work is to propose a...

Simple Randomized Leader Election with Extensions**

Leader election causes a unique processor to be distinguished from among a collection of processors. As the study of this problem progressed, increasingly e cient, then more general algorithms emerged. Eventually, Las Vegas algorithms for leader election on rings with identi ers and for those without that achieve asymptotically optimal expected message and bit communication complexity emerged (...

Randomized fault-detecting leader election in a bi-directional ring

This article presents a randomized algorithm for leader election which uses bi-directionality of an asynchronous ring to force a node to “commit” to a coin flip by sending it in both directions. The algorithm is fault-detecting in a strong sense: it works if and only if there is a connected segment of [n/21+ 1 non-faulty processors (n = ringsize). Faulty processors may do anything to disrupt th...